Research Interests: Summary

نویسندگان

  • Martin Milanič
  • Vadim V. Lozin
چکیده

My current research interests are in structural and algorithmic graph theory – a field connecting pure mathematics with theoretical computer science. I am particularly interested in studying ways to cope with (hard) optimization problems on graphs. In these problems, it is often desirable to find a particular substructure of a graph that is optimal with respect to some criteria. A general framework for these problems is: Given a graph, find a subset of its vertices (or edges) of minimum or maximum cardinality (or weight), subject to some specified constraints (requirements). For example, the maximum independent set problem asks for a maximum subset of pairwise non-adjacent vertices in a given graph. See [28] for a general introduction to graph theory, and [7] for an algorithmic point of view. Most graph optimization problems are computationally intractable; they are among the many NP-hard problems (the monograph by Garey and Johnson [8] is a classic reference for basics of computational complexity). There are several ways of dealing with an NP-hard problem. Since solving such a problem to optimality is believed to be prohibitive in terms of computational time, we can instead try to develop approximation algorithms, which allow us to obtain approximate solutions in reasonable time. Also, even though a problem may be hard in general, it is sometimes possible to find restrictions on the input instances under which the problem can be solved efficiently, i.e., in polynomial time. Of course, what’s interesting here is to identify cases for which polynomialtime solutions require new algorithmic ideas. Most of my research is devoted to these and related issues.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Summary of selected topics from G. J. Babu’s Research

G. J. Babu has diverse research interests in both statistics and probability, and their applications to problems in biomedical research, Population Genetics, astronomy and astrophysics. His research interests have varied over the years. He has contributed extensively to probabilistic number theory, resampling methods, nonparametric methods and asymptotic theory. He published seven books and ove...

متن کامل

The best interests of the child and the return of results in genetic research: international comparative perspectives

BACKGROUND Paediatric genomic research raises particularly challenging questions on whether and under what circumstances to return research results. In the paediatric context, decision-making is guided by the best interests of the child framework, as enshrined in the 1989 international Convention on the Rights of the Child. According to this Convention, rights and responsibilities are shared be...

متن کامل

Research Summary

My research interest in computer vision includes human activity recognition, human motion analysis, tracking, human identification, gait and gesture recognition, statistical methods for computer vision. I mainly focus on developing robust real-time algorithms based on sound theory for solving realistic computer vision problems for many applications. My research is widely applicable in visual su...

متن کامل

Improving personality and interest measurement for purposes of selection and assessment: Summary and general discussion

7 Summary and general discussion 123 Personality and vocational interest measures have been found to be predictive of behavior and academic/job outcomes, consequently, they are often used in practice. Vocational interests are usually measured when people need to decide which vocations they wish to pursue. More than 50% of all Dutch aspiring students fills in a vocational interest measure before...

متن کامل

Clifford D . Smyth

My research interests lie in discrete mathematics and complexity theory (MSC 05, 52, 60, 68) and my research falls mostly into one or more of the following topics: combinatorial probability, computational complexity, combinatorial geometry, random structures, and extremal problems. After a brief overview of my completed research, I will give a more detailed summary of some of its aspects and fu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007